Bounds on Herman's algorithm
نویسنده
چکیده
Herman’s self-stabilisation algorithm allows a ring of N processors having any odd number of tokens to reach a stable state where exactly one token remains. McIver and Morgan conjecture that the expected time taken for stabilisation is maximised when there are three equally-spaced tokens. We prove exact results on a related cost function, and obtain a bound on expected time which is very close to the conjectured bound.
منابع مشابه
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we study the expected time to stabilization in terms of the initial configuration. It is straightforward that the algorithm achieves stabilization almost surely fr...
متن کاملAutomatic Bounding Estimation in Modified Nlms Algorithm
Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...
متن کاملProgramming Research Group Proof Rules for Probablistic Loops
Probabilistic predicate transformers provide a semantics for imperative programs containing both demonic and probabilistic nondeterminism. Like the (standard) predicate transformers popularised by Dijkstra, they model programs as functions from nal results to the initial conditions su cient to achieve them. This paper presents practical proof rules, using the probabilistic transformers, for rea...
متن کاملOn the Expected Time for Herman's Probabilistic Self-stabilizing Algorithm
In this article we investigate the expected time for Herman’s probabilistic self-stabilizing algorithm in distributed systems: suppose that the number of identical processes in a unidirectional ring, say n, is odd and n 3. If the initial configuration of the ring is not “legitimate”, that is, the number of tokens differs from one, then execution of the algorithm made up of synchronous probabili...
متن کاملSeveral Tokens in Herman's algorithm
We have a cycle of N nodes and there is a token on an odd number of nodes. At each step, each token independently moves to its clockwise neighbor or stays at its position with probability 2 . If two tokens arrive to the same node, then we remove both of them. The process ends when only one token remains. The question is that for a fixed N , which is the initial configuration that maximizes the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 550 شماره
صفحات -
تاریخ انتشار 2014